GA-Based Hybrid Algorithm for MBR Problem of FIPP p-Cycles for Node Failure on Survivable WDM Networks
نویسنده
چکیده
In this paper, the minimal backup reprovisioning (MBR) problem is studied, in which, the failure-independent path protecting pcycles (FIPP p-cycles) scheme is considered for single node-failure on WDM networks. After recovering the affected lightpaths from a node failure, the goal of the MBR is to re-arrange the protecting and available resources such that working paths can be protected against next node failure if possible. This is a hard problem, a hybrid algorithm which combines heuristic algorithm and genetic algorithm is proposed to solve this problem. The simulation results of the proposed method are also given.
منابع مشابه
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the netw...
متن کاملPolynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)
The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...
متن کاملOptimization of Spare Capacity in Survivable WDM Networks
Abstract. A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for the network to survive from network component failures. In this paper, this problem is investigated for wavelength division multiplexing (WDM) mesh networks without wavelength conversion. We propose a hybrid...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA Novel Efficient Design of Survivable WDM Mesh Networks
The design of survivable WDM mesh networks based on p-cycles has been extensively studied. However, most of studies only deal with a single link failure rather than node failure. In this paper, we develop a new scalable and efficient design method for computing node-protecting p-cycles in order to ensure network survivability. The performance of our new proposed design method makes an obvious i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011